Efficient computation of Laguerre polynomials
نویسندگان
چکیده
منابع مشابه
Efficient computation of Laguerre polynomials
An efficient algorithm and a Fortran 90 module (LaguerrePol) for computing Laguerre polynomials L (α) n (z) are presented. The standard threeterm recurrence relation satisfied by the polynomials and different types of asymptotic expansions valid for n large and α small, are used depending on the parameter region. Based on tests of contiguous relations in the parameter α and the degree n satisfi...
متن کاملLaguerre and Jacobi polynomials
We present results on co-recursive associated Laguerre and Jacobi polynomials which are of interest for the solution of the Chapman-Kolmogorov equations of some birth and death processes with or without absorption. Explicit forms, generating functions, and absolutely continuous part of the spectral measures are given. We derive fourth-order differential equations satisfied by the polynomials wi...
متن کاملLaguerre-type Bell polynomials
We develop an extension of the classical Bell polynomials introducing the Laguerre-type version of this well-known mathematical tool. The Laguerre-type Bell polynomials are useful in order to compute the nth Laguerre-type derivatives of a composite function. Incidentally, we generalize a result considered by L. Carlitz in order to obtain explicit relationships between Bessel functions and gener...
متن کاملEfficient Computation of Chromatic and Flow Polynomials
Efficient Computation of Chromatic and Flow Polynomials
متن کاملSpecializations of Generalized Laguerre Polynomials
Three specializations of a set of orthogonal polynomials with “8 different q’s” are given. The polynomials are identified as q-analogues of Laguerre polynomials, and the combinatorial interpretation of the moments give infinitely many new Mahonian statistics on permutations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2017
ISSN: 0010-4655
DOI: 10.1016/j.cpc.2016.09.002